Index Compression for Audio Fingerprinting Systems Based on Compressed Suffix Array
نویسندگان
چکیده
منابع مشابه
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
A compressed text database based on the compressed suffix array is proposed. The compressed suffix array of Grossi and Vitter occupies only O(n) bits for a text of length n; however it also uses the text itself that occupies O(n log |Σ|) bits for the alphabet Σ. On the other hand, our data structure does not use the text itself, and supports important operations for text databases: inverse, sea...
متن کاملA Re-ordering Strategy for Accelerating Index-based Audio Fingerprinting
The Haitsma/Kalker audio fingerprinting system [4] has been in use for years, but its search algorithm’s scalability has not been researched very well. In this paper we show that by simple re-ordering of the query fingerprint’s subprints in the index-based retrieval step, the overall search performance can be increased significantly. Furthermore, we show that combining longer fingerprints with ...
متن کاملA Compressed Suffix-Array Strategy for Temporal-Graph Indexing
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a set of 4-tuples 〈vs, ve, ts, te〉 indicating that an edge from a vertex vs to a vertex ve is active during the time interval [ts, te). Representing those tuples involves the challenge of not only saving space but also of efficient query processing. Queries of interest fo...
متن کاملA Compressed Enhanced Suffix Array Supporting Fast String Matching
Index structures like the suffix tree or the suffix array are of utmost importance in stringology, most notably in exact string matching. In the last decade, research on compressed index structures has flourished because the main problem in many applications is the space consumption of the index. It is possible to simulate the matching of a pattern against a suffix tree on an enhanced suffix ar...
متن کاملSuffix Array of Alignment: A Practical Index for Similar Data
The suffix tree of alignment is an index data structure for similar strings. Given an alignment of similar strings, it stores all suffixes of the alignment, called alignment-suffixes. An alignment-suffix represents one suffix of a string or suffixes of multiple strings starting at the same position in the alignment. The suffix tree of alignment makes good use of similarity in strings theoretica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information and Education Technology
سال: 2013
ISSN: 2010-3689
DOI: 10.7763/ijiet.2013.v3.317